منابع مشابه
Non-mitotic Sets
We study the question of the existence of non-mitotic sets in NP. We show under various hypotheses that • 1-tt-mitoticity and m-mitoticity differ on NP. • 1-tt-reducibility and m-reducibility differ on NP. • There exist non-T-autoreducible sets in NP (by a result from Ambos-Spies, these sets are neither T-mitotic nor m-mitotic). • T-autoreducibility and T-mitoticity differ on NP (this contrasts...
متن کاملCentrosome Size Sets Mitotic Spindle Length in Caenorhabditis elegans Embryos
Just as the size of an organism is carefully controlled, the size of intracellular structures must also be regulated. The mitotic spindle is a supramolecular machine that generates the forces which separate sister chromatids during mitosis. Although spindles show little size variation between cells of the same type, spindle length can vary at least 10-fold between different species. Recent expe...
متن کاملNon-computable Julia sets
Polynomial Julia sets have emerged as the most studied examples of fractal sets generated by a dynamical system. Apart from the beautiful mathematics, one of the reasons for their popularity is the beauty of the computer-generated images of such sets. The algorithms used to draw these pictures vary; the most näıve work by iterating the center of a pixel to determine if it lies in the Julia set....
متن کاملTotally non-immune sets
Let L be a countable first-order language and M = (M, . . .) be an L-structure. “Definable set” means a subset of M which is L-definable in M with parameters. A set X ⊆ M is said to be immune if it is infinite and does not contain any infinite definable subset. X is said to be partially immune if for some definable A, A∩X is immune. X is said to be totally non-immune if for every definable A, A...
متن کاملNon-Partitionable Point Sets
Let S be a finite set of n points in d-dimensional space. S is e.(n)-partitionable if there exists a set of d mutually intersecting hyperplanes that divide d-space into 2d open regions, no 2d 1 of which together contain more than o(n) points of S. Willard (1982) has shown that every set in 2-space is :n-partitionable. Yao (1983) has shown that every set in 3-space is gn-partitionable. It is sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.12.043